Derivative-Free Online Learning of Inverse Dynamics Models
نویسندگان
چکیده
منابع مشابه
Efficient derivative-free Kalman filters for online learning
The extended Kalman filter (EKF) is considered one of the most effective methods for both nonlinear state estimation and parameter estimation (e.g., learning the weights of a neural network). Recently, a number of derivative free alternatives to the EKF for state estimation have been proposed. These include the Unscented Kalman Filter (UKF) [1, 2], the Central Difference Filter (CDF) [3] and th...
متن کاملOnline Incremental Learning of Inverse Dynamics Incorporating Prior Knowledge
Recent approaches to model-based manipulator control involve data-driven learning of the inverse dynamics relationship of a manipulator, eliminating the need for any knowledge of the system model. Ideally, such algorithms should be able to process large amounts of data in an online and incremental manner, thus allowing the system to adapt to changes in its model structure or parameters. Locally...
متن کاملInterference in Learning Internal Models of Inverse Dynamics in Humans
Experiments were performed to reveal some of the computational properties of the human motor memory system. We show that as humans practice reaching movements while interacting with a novel mechanical environment, they learn an internal model of the inverse dynamics of that environment. Subjects show recall of this model at testing sessions 24 hours after the initial practice. The representatio...
متن کاملOleF: An Inverse-Free Online Cipher
Online ciphers, in spite of being insecure against an sprp adversary, can be desirable at places because of their ease of implementation and speed. Here we propose a single-keyed inverse-free construction that achieves online sprp security with an optimal number of blockcipher calls. We also include a partial block construction, without requiring any extra key.
متن کاملProjection-free Online Learning
The computational bottleneck in applying online learning to massive data sets is usually the projection step. We present efficient online learning algorithms that eschew projections in favor of much more efficient linear optimization steps using the Frank-Wolfe technique. We obtain a range of regret bounds for online convex optimization, with better bounds for specific cases such as stochastic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control Systems Technology
سال: 2020
ISSN: 1063-6536,1558-0865,2374-0159
DOI: 10.1109/tcst.2019.2891222